Using Bounded Model Checking to Focus Fixpoint Iterations

Using Fixpoint Characterisations of LTL for Bounded Model Checking

Bounded Model Checking [2] is an approach to the LTL model checking problem which uses an encoding to Boolean satisfiability. The encoding as defined by Biere et al. [2] has certain shortcomings, particularly in the size of the clause forms that it generates. We address this by making use of the established correspondence between temporal logic expressions and the fixed points of functions [7],...

A compact linear translation for bounded model checking 1 Paul

We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to the Separated Normal Form encoding proposed in [5] and extended to past time in [3]: an initial phase involves putting LTL formulae into a normal form based on linear-time fixpoint characterisations of temporal operators....

A Fixpoint Based Encoding for Bounded Model Checking

Advances in SymbolicModel Checking Techniques

A common theme in symbolic model checking is to compute an inductive strengthening of the desired invariant, which forms a proof that no erroneous state can be reached by the system. The original symbolic model checking algorithm computed this inductive strengthening by computing (a hopefully succinct) representation of all reachable states by fixpoint computations and OBDDs. This set of reacha...

The Complexity of Model Checking Higher Order Fixpoint Logic

Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal μ-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal μ-calculus. This paper provides complexity results for its model checking problem. In particular, we consider those fragme...